Improving KD-Tree Based Retrieval for Attribute Dependent Generalized Cases
نویسندگان
چکیده
Generalized cases are cases that cover a subspace rather than a point in the problem-solution space. Attribute dependent generalized cases are a subclass of generalized cases, which cause a high computational complexity during similarity assessment. We present a new approach for an efficient indexbased retrieval of such generalized cases by an improved kdtree approach. The experimental evaluation demonstrates a significant improvement in retrieval efficiency compared to
منابع مشابه
Approximative Retrieval of Attribute Dependent Generalized Cases
In our current research project about electronic designs the problem to retrieve attribute dependent generalized cases occurs. This kind of cases cover an arbitrary subspace rather than a point in the space, spanned by the cases attributes and by a set of constraints. For such representations, the similarity assessment between a point query and generalized cases is a difficult problem for which...
متن کاملOmega-storage: A Self Organizing Multi-Attribute Storage Technique for Very Large Main Memories
Main memory is continuously improving both in price and capacity. With this comes new storage problems as well as new directions of usage. Just before the millennium, several main memory database systems are becoming commercially available. The hot areas include boosting the performance of web-enabled systems, such as search-engines, and auctioning systems. We present a novel data storage struc...
متن کاملO-Storage: A Self Organizing Multi-Attribute Storage Technique for Very Large Main Memories
Main memory is continuously improving both in price and capacity. With this comes new storage problems as well as new directions of usage. Just before the millennium, several main memory database systems are becoming commercially available. The hot areas include boosting the performance of web-enabled systems, such as search-engines, and auctioning systems. We present a novel data storage struc...
متن کاملProbabilistic cost model for nearest neighbor search in image retrieval
We present a probabilistic cost model to analyze the performance of the kd-tree for nearest neighbor search in the context of content-based image retrieval. Our cost model measures the expected number of kd-tree nodes traversed during the search query. We show that our cost model has high correlations with both the observed number of traversed nodes and the runtime performance of search queries...
متن کاملFont Recognition Using Shape-Based Quad-tree and Kd-tree Decomposition
The search for appropriate data representations and visual features for content-based image retrieval continues within the computer vision community, alongside the development of new matching and indexing techniques to facilitate fast search in large-scale image databases. In this study, we present a solution to the problem of typeface identification and character recognition in text-based imag...
متن کامل